Computing Tate Pairing on Smartcards
نویسندگان
چکیده
In this paper, we present the results of computing the Tate pairing using a supersingular elliptic curve defined over a prime field. The aim of this work is to demonstrate the feasibility of the primitives of identity based cryptosystem for application in embedded processors such as a smartcard. The most computationally intensive operation in an Identity Based Protocol is the calculation of a pairing function. We report the timing of Tate pairing computation for a PC platform and for the 32-bit ST22 smartcard microprocessor. The use of supersingular elliptic curves permits the use of a field where the characteristic is a large prime p with low Hamming weight. This results in a faster modular reduction operation when compared to the use of Montgomery modular multiplication used in literature where MNT curves are adopted.
منابع مشابه
Implementing Cryptographic Pairings on Smartcards
Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations of Identity-Based Encryption (IBE). In this paper we describe the implementation of various pairings on a contemporary 32-bit smart-card, the Philips HiPerSmart, an instantiation of the MIPS-32 based SmartMIPS architecture. Th...
متن کاملImplementation And Optimization For Tate Pairing
Tate pairings has found several new applications in cryptography. However, how to compute Tate pairing is a research focus in all kinds of applications of pairing-based cryptosystems (PBC). In the paper, the structure of Miller’s algorithm is firstly analyzed, which is used to implement Tate pairing. Based on the characteristics that Miller’s algorithm will be improved tremendous if the order o...
متن کاملThe Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as elliptic nets, which are maps from Z to a ring that satisfy a certain recurrence relation. We explain how an elliptic net is associated to an elliptic curve and reflects its group structure. Then we give a formula for ...
متن کاملImplementation of Tate Pairing on Hyperelliptic Curves of Genus 2
Since Tate pairing was suggested to construct a cryptosystem, fast computation of Tate pairing has been researched recently. Barreto et. al[3] and Galbraith[8] provided efficient algorithms for Tate pairing on y = x − x + b in characteristic 3 and Duursma and Lee[6] gave a closed formula for Tate pairing on y = x − x + d in characteristic p. In this paper, we present completely general and expl...
متن کاملTate pairing computation on the divisors of hyperelliptic curves for cryptosystems
In recent papers [4], [9] they worked on hyperelliptic curves Hb defined by y +y = x+x+b over a finite field F2n with b = 0 or 1 for a secure and efficient pairing-based cryptosystems. We find a completely general method for computing the Tate-pairings over divisor class groups of the curves Hb in a very explicit way. In fact, Tate-pairing is defined over the entire divisor class group of a cur...
متن کامل